Uniform multicommodity flow in the hypercube with random edge capacities
نویسندگان
چکیده
We give two results for multicommodity flows in the d-dimensional hypercube Qd with independent random edge-capacities distributed like a random variable C where P[C > 0] > 1/2. Firstly, with high probability as d → ∞, the network can support simultaneous multicommodity flows of volume close to E[C] between all antipodal vertex pairs. Secondly, with high probability, the network can support simultaneous multicommodity flows of volume close to 21−dE[C] between all vertex pairs. Both results are best possible.
منابع مشابه
Uniform multicommodity flows in the hypercube with random edge-capacities
We give two results for multicommodity flows in the d-dimensional hypercube Qd with independent random edge capacities distributed like C where P[C > 0] > 1/2. Firstly, with high probability as d → ∞, the network can support simultaneous multicommodity flows of volume close to E[C] between all antipodal vertex pairs. Secondly, with high probability, the network can support simultaneous multicom...
متن کاملUniform multicommodity flow through the complete graph with random edge-capacities
Give random capacities C to the edges of the complete n-vertex graph. Consider the maximum flow Φn that can be simultaneously routed between each source-destination pair. We prove that Φn → φ in probability where the limit constant φ depends on the distribution of C in a simple way, and that asymptotically one need use only oneand two-step routes. The proof uses a reduction to a random graph pr...
متن کاملOptimal Multicommodity Flow through the Complete Graph with Random Edge-capacities
We consider a multicommodity flow problem on a complete graph with the edges having random i.i.d capacities. We show that as the number of nodes tends to infinity, the maximum utility, given by the average of a concave function of each commodity flow, has an almost sure limit. Further, the asymptotically optimal flow uses only direct and two-hop paths, and can be obtained in a distributed manner.
متن کاملFaster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
This paper describes new algorithms for approximately solving the concurrent multicommodity flow problem with uniform capacities. These algorithms are much faster than algorithms discovered previously. Besides being an important problem in its own right, the uniform-capacity concurrent flow problem has many interesting applications. Leighton and Rao used uniform-capacity concurrent flow to find...
متن کاملNode-Capacitated Ring Routing
We consider the node-capacitated routing problem in an undirected ring network along with its fractional relaxation, the node-capacitated multicommodity flow problem. For the feasibility problem, Farkas’ lemma provides a characterization for general undirected graphs asserting roughly that there exists such a flow if and only if the so-called distance inequality holds for every choice of distan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1406.4433 شماره
صفحات -
تاریخ انتشار 2014